Domination in graphs with minimum degree twoMCCUAIG, W; SHEPHERD, B.Journal of graph theory. 1989, Vol 13, Num 6, pp 749-762, issn 0364-9024, 14 p.Article

The strong perfect graph conjecture for pan-free graphsOLARIU, S.Journal of combinatorial theory. Series B. 1989, Vol 47, Num 2, pp 187-191, issn 0095-8956, 5 p.Article

Algebraic and topological graph theory for orderingKAVEH, A.Zeitschrift für angewandte Mathematik und Mechanik. 1991, Vol 71, Num 6, pp T739-T742, issn 0044-2267Article

Simple perfect squared squares and 2 × 1 squared rectangles of order 26DUIJVESTIJN, A. J. W.Mathematics of computation. 1996, Vol 65, Num 215, pp 1359-1364, issn 0025-5718Article

Reconstruction of hypertreesSENGE, H. G.Pacific journal of mathematics. 1985, Vol 118, Num 2, pp 565-574, issn 0030-8730Article

6th International Conference on Graph TheoryFOUQUET, J.-L; RUSU, I.Discrete mathematics. 2004, Vol 276, Num 1-3, issn 0012-365X, 411 p.Conference Proceedings

Workshop on graph-based toolsMENS, Tom; SCHÜRR, Andy; TAENTZER, Gabriele et al.Lecture notes in computer science. 2002, pp 440-444, issn 0302-9743, isbn 3-540-44310-X, 5 p.Conference Paper

Recognition and orientation algorithms for P₄-Comparability graphsNIKOLOPOULOS, Stavros D; PALIOS, Leonidas.Lecture notes in computer science. 2001, pp 320-331, issn 0302-9743, isbn 3-540-42985-9Conference Paper

Efficient and constructive algorithms for the pathwidth and treewidth of graphsBODLAENDER, H. L; KLOKS, T.Journal of algorithms (Print). 1996, Vol 21, Num 2, pp 358-402, issn 0196-6774Article

On the orderability problem for PLA foldingRAVI, S. S.Discrete applied mathematics. 1989, Vol 25, Num 3, pp 317-320, issn 0166-218X, 4 p.Article

Simple enumeration of minimal tiesets of undirected graphHASANUDDIN AHMAD, S.Microelectronics and reliability. 1989, Vol 29, Num 4, pp 509-510, issn 0026-2714, 2 p.Article

Association schemes of quadratic formsEGAWA, Y.Journal of combinatorial theory. Series A. 1985, Vol 38, Num 1, pp 1-14, issn 0097-3165Article

Graph theory and fluid dynamicsGUSTAFSON, K; HARTMAN, R.SIAM journal on algebraic and discrete methods. 1985, Vol 6, Num 4, pp 643-656, issn 0196-5212Article

[a,b]-factorization of a graphKANO, M.Journal of graph theory. 1985, Vol 9, Num 1, pp 129-146, issn 0364-9024Article

Distance regular graphs of diameter 3 and strongly regular graphsBROUWER, A. E.Discrete mathematics. 1984, Vol 49, Num 1, pp 101-103, issn 0012-365XArticle

Embedding graphs in surfacesHOFFMAN, P; RICHTER, B.Journal of combinatorial theory. Series B. 1984, Vol 36, Num 1, pp 65-84, issn 0095-8956Article

Infinite families of crossing-critical graphs with a given crossing numberSIRAN, J.Discrete mathematics. 1984, Vol 48, Num 1, pp 129-132, issn 0012-365XArticle

Layouts for the shuffle-exchange graph based on the complex plane diagramTHOMSON LEIGHTON, F; LEPLEY, M; MILLER, G. L et al.SIAM journal on algebraic and discrete methods. 1984, Vol 5, Num 2, pp 202-215, issn 0196-5212Article

A composition for perfect graphsBIXBY, R. E.North-Holland mathematics studies. 1984, Vol 88, pp 221-224, issn 0304-0208Article

A generalization of outerplanar graphsOUBINA, L; ZUCCHELLO, R.Discrete mathematics. 1984, Vol 51, Num 3, pp 243-249, issn 0012-365XArticle

Classical perfect graphs: an introduction with emphasis on triangulated an interval graphsDUCHET, P.North-Holland mathematics studies. 1984, Vol 88, pp 67-96, issn 0304-0208Article

Decomposition of graphs of modules over semisimple ringsORZECH, G.Bulletin of the Australian Mathematical Society. 1984, Vol 29, Num 3, pp 405-413, issn 0004-9727Article

Doubly Eulerian trails on rectangular gridsBRENNER, J. L; LYNDON, R. C.Journal of graph theory. 1984, Vol 8, Num 3, pp 379-385, issn 0364-9024Article

Graphs with eulerian chainsEGGLETON, R. B; SKILTON, D. K.Bulletin of the Australian Mathematical Society. 1984, Vol 29, Num 3, pp 389-399, issn 0004-9727Article

H-extension of graphsSHEE, S. C; TEH, H. H.Combinatorica (Print). 1984, Vol 4, Num 2-3, pp 207-211, issn 0209-9683Article